DYNAMICS OF THE w FUNCTION AND THE GREEN-TAO THEOREM ON ARITHMETIC PROGRESSIONS IN THE PRIMES
نویسندگان
چکیده
Let A3 be the set of all positive integers pqr, where p, q, r are primes and possibly two, but not all three of them are equal. For any n = pqr ∈ A3, define a function w by w(n) = P (p + q)P (p + r)P (q + r), where P (m) is the largest prime factor of m. It is clear that if n = pqr ∈ A3, then w(n) ∈ A3. For any n ∈ A3, define w0(n) = n, wi(n) = w(wi−1(n)) for i = 1, 2, . . . . An element n ∈ A3 is semi-periodic if there exists a nonnegative integer s and a positive integer t such that ws+t(n) = ws(n). We use ind(n) to denote the least such nonnegative integer s. Wushi Goldring [Dynamics of the w function and primes, J. Number Theory 119(2006), 86-98] proved that any element n ∈ A3 is semi-periodic. He showed that there exists i such that wi(n) ∈ {20, 98, 63, 75}, ind(n) 4(π(P (n))− 3), and conjectured that ind(n) can be arbitrarily large. In this paper, it is proved that for any n ∈ A3 we have ind(n) = O((logP (n))2), and the Green-Tao Theorem on arithmetic progressions in the primes is employed to confirm Goldring’s above conjecture.
منابع مشابه
Green-tao Theorem in Function Fields
We adapt the proof of the Green-Tao theorem on arithmetic progressions in primes to the setting of polynomials over a finite field, to show that for every k, the irreducible polynomials in Fq[t] contain configurations of the form {f + P g : deg(P) < k}, g = 0.
متن کاملPrimes in Arbitrarily Long Arithmetic Progression
It has been a long conjecture that there are arbitrarily long arithmetic progressions of primes. As of now, the longest known progression of primes is of length 26 and was discovered by Benoat Perichon and PrimeGrid in April, 2010 ([1]): 43142746595714191+23681770·223092870n for n = 0, 1, · · · , 25. Many mathematicians have spent years trying to prove (or disprove) this conjecture, and even mo...
متن کاملGreen-tao Theorem in Function Fields
We adapt the proof of the Green-Tao theorem on arithmetic progressions in primes to the setting of polynomials over a finite fields, to show that for every k, the irreducible polynomials in Fq[t] contains configurations of the form {f + P g : deg(P) < k}, g = 0.
متن کاملAnalysis and Ergodic Theory
We cover the second half of Green and Tao’s proof of the existence of arbitrarily long arithmetic progressions of prime numbers, by constructing a function and pseudorandom measure suitably associated to the primes. 1.1 Orienting remarks The proof of the Green-Tao Theorem breaks conveniently into two distinct stages: 1. First, it is shown how the conclusion of Szemerédi’s Theorem can be extende...
متن کاملA Short Proof of the Multidimensional Szemerédi Theorem in the Primes
Tao conjectured that every dense subset of P, the d-tuples of primes, contains constellations of any given shape. This was very recently proved by Cook, Magyar, and Titichetrakun and independently by Tao and Ziegler. Here we give a simple proof using the Green-Tao theorem on linear equations in primes and the Furstenberg-Katznelson multidimensional Szemerédi theorem. Let PN denote the set of pr...
متن کامل